Restricted relativizations of probabilistic polynomial time
نویسندگان
چکیده
منابع مشابه
Polynomial Time with Restricted Use of Randomness
We define a hierarchy of complexity classes that lie between P and RP, yielding a new way of quantifying partial progress towards the derandomization of RP. A standard approach in derandomization is to reduce the number of random bits an algorithm uses. We instead focus on a model of computation that allows us to quantify the extent to which random bits are being used. More specifically, we con...
متن کاملType-two polynomial-time and restricted lookahead
This paper provides an alternate characterization of type-two polynomial-time computability, with the goal of making second-order complexity theory more approachable. We rely on the usual oracle machines to model programs with subroutine calls. In contrast to previous results, the use of higher-order objects as running times is avoided, either explicitly or implicitly. Instead, regular polynomi...
متن کاملOn Expected Probabilistic Polynomial-Time Adversaries: A suggestion for restricted de nitions and their bene ts
This paper concerns the possibility of developing a coherent theory of security when feasibility is associated with expected probabilistic polynomial-time (expected PPT). The source of diiculty is that the known deenitions of expected PPT strategies (i.e., expected PPT interactive machines) do not support natural results of the type presented below. To overcome this diiculty, we suggest new dee...
متن کاملImmunity and Simplicity in Relativizations of Probabilistic Complexity Classes
The existence of immune and simple sets in relativizations of the probabilistic polynomial time bounded classes is studied. Some techniques previously used to show similar results for relativizations of P and NP are adapted to the probabilistic classes. Using these results, an exhaustive settling of ail possible strong séparations among these relativized classes is obtained. Résumé. -On étudie ...
متن کاملProbabilistic Polynomial-Time Equivalence and Security Analysis
We use properties of observational equivalence for a proba-bilistic process calculus to prove an authentication property of a cryptographic protocol. The process calculus is a form of-calculus, with probabilistic scheduling instead of nondeterminism, over a term language that captures probabilistic polynomial time. The operational semantics of this calculus gives priority to communication over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90333-b